翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク calculus of communicating systems ： ウィキペディア英語版 calculus of communicating systems The Calculus of Communicating Systems (CCS) is a process calculus introduced by Robin Milner around 1980 and the title of a book describing the calculus. Its actions model indivisible communications between exactly two participants. The formal language includes primitives for describing parallel composition, choice between actions and scope restriction. CCS is useful for evaluating the qualitative correctness of properties of a system such as deadlock or livelock. According to Milner, "There is nothing canonical about the choice of the basic combinators, even though they were chosen with great attention to economy. What characterises our calculus is not the exact choice of combinators, but rather the choice of interpretation and of mathematical framework". The expressions of the language are interpreted as a labelled transition system. Between these models, bisimilarity is used as a semantic equivalence. ==Syntax== Given a set of action names, the set of CCS processes is defined by the following BNF grammar: :$P\; ::=\; \backslash emptyset\backslash ,\backslash ,\backslash ,\; |\; \backslash ,\backslash ,\backslash ,a.P\_1\backslash ,\backslash ,\backslash ,\; |\; \backslash ,\backslash ,\backslash ,A\backslash ,\backslash ,\backslash ,\; |\; \backslash ,\backslash ,\backslash ,P\_1+P\_2\backslash ,\backslash ,\backslash ,\; |\; \backslash ,\backslash ,\backslash ,P\_1|P\_2\backslash ,\backslash ,\backslash ,\; |\; \backslash ,\backslash ,\backslash ,P\_1()\backslash ,\backslash ,\backslash ,\; |\; \backslash ,\backslash ,\backslash ,P\_1a\backslash ,\backslash ,\backslash ,$ The parts of the syntax are, in the order given above ; empty process : the empty process $\backslash emptyset$ is a valid CCS process ; action : the process $a.P\_1$ can perform an action $a$ and continue as the process $P\_1$ ; process identifier : write $A\; \backslash overset\}\; P\_1$ to use the identifier $A$ to refer to the process $P\_1$ (which may contain the identifier $A$ itself, i.e., recursive definitions are allowed) ; choice : the process $P\_1+P\_2$ can proceed either as the process $P\_1$ or the process $P\_2$ ; parallel composition : $P\_1|P\_2$ tells that processes $P\_1$ and $P\_2$ exist simultaneously ; renaming : $P\_1()$ is the process $P\_1$ with all actions named $a$ renamed as $b$ ; restriction : $P\_1a$ is the process $P\_1$ without action $a$ 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「calculus of communicating systems」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.